Fast Non-Cartesian Reconstruction with Pruned Fast Fourier Transform
نویسندگان
چکیده
PURPOSE: Non-Cartesian imaging is essential in applications such as ultra-short time-echo imaging and realtime cardiac imaging. However, reconstruction speed becomes a limitation when iterative reconstruction is desired for parallel imaging, compressed sensing or artifact correction. In this work, we propose using pruned Fast Fourier Transform (pruned FFT) to accelerate almost all fast non-Cartesian reconstruction methods (gridding, toeplitzcirculant embedding, iterative, non-iterative). For iterative methods, we also propose partial pruning to approximate the non-Cartesian Fourier Transform operator to speed up each iteration while guaranteeing convergence.
منابع مشابه
Rapid Non-Cartesian Regularized SENSE Reconstruction using a Point Spread Function Model
Synopsis Iterative reconstructions of undersampled non-Cartesian data are computationally expensive because non-Cartesian Fourier transforms are much less e cient than Cartesian Fast Fourier Transforms. Here, we introduce an algorithm that does not require non-uniform Fourier transforms during optimization iterations, resulting in large reductions in computation times with no impairment of imag...
متن کاملImproving Non-Cartesian MRI Reconstruction through Discontinuity Subtraction
Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesian k-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these probl...
متن کاملPython Non-Uniform Fast Fourier Transform (PyNUFFT): multi-dimensional non-Cartesian image reconstruction package for heterogeneous platforms and applications to MRI
This paper reports the development of a Python Non-Uniform Fast Fourier Transform (PyNUFFT) package, which accelerates non-Cartesian image reconstruction on heterogeneous platforms. Scientific computing with Python encompasses a mature and integrated environment. The NUFFT algorithm has been extensively used for non-Cartesian image reconstruction but previously there was no native Python NUFFT ...
متن کاملFast Iterative Reconstruction for MRI from Nonuniform k-space Data
In magnetic resonance imaging (MRI), methods that use a non-Cartesian (e.g. spiral) sampling grid in k-space are becoming increasingly important. Reconstruction is usually performed by resampling the data onto a Cartesian grid. In this paper we compare the standard approach (gridding) and an approach based on an implicit discretisation. We show that both methods can be solved efficiently with t...
متن کاملA fast back-projection algorithm for bistatic SAR imaging
Using a far-field model, bistatic synthetic aperture radar (SAR) acquires Fourier data on a rather unusual, non-Cartesian grid in the Fourier domain. Previous image formation algorithms were mainly based on direct Fourier reconstruction to take advantage of the FFT, but the irregular coverage of the available Fourier domain data and the 2-D interpolation in the Fourier domain may adversely affe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014